Data driven Dirichlet sampling on manifolds
نویسندگان
چکیده
This article presents a new method to sample on manifolds, based the Dirichlet distribution. The proposed strategy allows completely respect underlying manifold around which data are observed, and do massive sampling with low computational effort. can be very helpful, for instance, in neural networks training process, as well uncertainty analysis stochastic optimization. Due its simplicity efficiency, we believe that has great potential. Three manifolds (two dimensional ring, Mobius strip spider geometry) used test methodology, then it is employed an engineering application, related bearing coefficients of rotating machine. In augmented train network.
منابع مشابه
Dirichlet Duality and the Nonlinear Dirichlet Problem on Riemannian Manifolds
In this paper we study the Dirichlet problem for fully nonlinear secondorder equations on a riemannian manifold. As in our previous paper [HL4] we define equations via closed subsets of the 2-jet bundle where each equation has a natural dual equation. Basic existence and uniqueness theorems are established in a wide variety of settings. However, the emphasis is on starting with a constant coeff...
متن کاملData-Driven Manifolds for Outdoor Motion Capture
Human motion capturing (HMC) from multiview image sequences is an extremely difficult problem due to depth and orientation ambiguities and the high dimensionality of the state space. In this paper, we introduce a novel hybrid HMC system that combines video input with sparse inertial sensor input. Employing an annealing particle-based optimization scheme, our idea is to use orientation cues deri...
متن کاملData-driven probability concentration and sampling on manifold
A new methodology is proposed for generating realizations of a random vector with values in a finite-dimensional Euclidean space that are statistically consistent with a dataset of observations of this vector. The probability distribution of this random vector, while a-priori not known, is presumed to be concentrated on an unknown subset of the Euclidean space. A random matrix is introduced who...
متن کاملScene Parsing by Data Driven Cluster Sampling
This paper presents a data-driven cluster sampling framework for parsing scene images into generic regions (such as the sky, mountain and water) and objects (such as cows, horses and cars). We adopt generative models for both generic regions and objects, thus their likelihood probabilities are comparable and are learned under a common information projection principle. The inference algorithm fo...
متن کاملData driven sampling of oscillating signals
The reduction of the number of samples is a key issue in signal processing for mobile applications. We investigate the link between the smoothness properties of a signal and the number of samples that can be obtained through a level crossing sampling procedure. The algorithm is analyzed and an upper bound of the number of samples is obtained in the worst case. The theoretical results are illust...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational Physics
سال: 2021
ISSN: ['1090-2716', '0021-9991']
DOI: https://doi.org/10.1016/j.jcp.2021.110583